Constraint Logic Planning

Deductive planning provides a rigorous approach for planning, such that the capabilities and limitations of the planning systems can be clearly deened. However, most of the deductive planners suuer from the frame problem and they are linear planners. This report presents a novel nonlinear deductive planning framework: constraint logic planning. Procedurally speaking, nonlinear planning is an activity of constraint solving. Constraint logic planning is a combination of the constraint solving for nonlinear planning with a temporal logic paradigm. In comparison with other state based deductive planning methods, constraint logic planning deals with the frame problem eeciently in a way similar to that in classical nonlinear planning, and constraint logic planning is a nonlinear deductive planning approach, it employs the least commitment strategy for both temporal relation decision and object selection. In comparison with classical nonlinear planning systems, constraint logic planning is a deductive planning approach and it achieves completeness, soundness and connict freeness. Constraint logic planning is believed to be even more eecient than classical nonlinear planning. educational or research purposes on condition that (1) this copyright notice is included, (2) proper attribution to the author or authors is made and (3) no commercial gain is involved.